A Computational Approach to Pronominal Anaphora, One- Anaphora and Surface Count Anaphora

This paper is the continuation of Ferrández [5][4] in which we have developed a computational system in Prolog (Slot Unification Parser or SUP) that includes a new grammatical formalism (Slot Unification Grammar or SUG). In this work, we are going to deal with several kinds of anaphora both in restricted and unrestricted texts: pronominal anaphora, surface count anaphora and one-anaphora. We only use the following kinds of information: lexical (the lemma of each word), morphologic (person, number, gender), semantic and syntactic. In order to deal with those kinds of anaphora in unrestricted texts, we have extended the grammar that is used in SUP. With these new grammar, the system is able to parse only the constituents required to deal with anaphor resolution (prepositional phrases, noun phrases, verbs and conjunctions).